Linear expand-contract plasticity of ellipsoids revisited

نویسندگان

چکیده

This work is aimed to describe linearly expand-contract plastic ellipsoids given via quadratic form of a bounded positively defined self-adjoint operator in terms its spectrum.Let $Y$ be metric space and $F\colon Y\to Y$ map. $F$ called non-expansive if it does not increase distance between points the $Y$. We say that subset $M$ normed $X$ (briefly an LEC-plastic) every linear $T\colon X \to X$ whose restriction on bijection from onto isometry $M$.In paper, we consider fixed separable infinite-dimensional Hilbert $H$. define ellipsoid $H$ as set following $E =\left\{x \in H\colon \left\langle x, Ax \right\rangle \le 1 \right\}$ where $A$ for which holds: $\inf_{\|x\|=1} Ax,x\right\rangle >0$ $\sup_{\|x\|=1} < \infty$.We provide example demonstrates spectrum generating has non empty continuous part, then such plastic.In this work, also proof only part eigenvalues consists more than one element either maximum finite multiplicity or minimum multiplicity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contract & Expand: I/O Efficient SCCs Computing

As an important branch of big data processing, big graph processing is becoming increasingly popular in recent years. Strongly connected component (SCC) computation is a fundamental graph operation on directed graphs, where an SCC is a maximal subgraph S of a directed graph G in which every pair of nodes is reachable from each other in S. By contracting each SCC into a node, a large general dir...

متن کامل

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...

متن کامل

solving fuzzy linear programming problems with linear membership functions-revisited

recently, gasimov and yenilmez proposed an approach for solving two kinds of fuzzy linear programming (flp) problems. through the approach, each flp problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. then, the crisp problem is solved by the use of the modified subgradient method. in this paper we will have another look at the earlier defuzzifi...

متن کامل

Stabilization of constrained linear systems via smoothed truncated ellipsoids

Polyhedral Lyapunov functions are convenient to solve the constrained stabilization problem of linear systems as non-conservative estimates of the domain of attraction can be obtained. Alternatively, truncated ellipsoids can be used to find an under-estimate of the feasible region, with a considerably reduced number of parameters. This paper reformulates classic geometric intersection operators...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Matemati?nì studìï

سال: 2022

ISSN: ['2411-0620', '1027-4634']

DOI: https://doi.org/10.30970/ms.57.2.192-201